Matroids: The Theory and Practice of Greed
نویسندگان
چکیده
A matroid is a mathematical structure that generalizes the notion of linear independence. Remarkably, this simple and elegant mathematical structure can be used to systematically develop efficient and simple “greedy” algorithms for a variety of discrete optimization problems. Moreover, matroids provide some insight into why other discrete optimization problems are apparently computationally intractable. This module introduces matroids and demonstrates their application to several discrete optimization problems. Prerequisites: The reader is assumed to be familiar with elementary concepts in linear algebra (definition and properties of linear independence) and elementary concepts in graph theory (definition of a graph, bipartite graph, and path).
منابع مشابه
Greed and Majorization
We present a straightforward linear algebraic model of greed, based only on extensions of classical majorization and convexity theory. This gives an alternative to other models of greedy-solvable problems such as matroids, greedoids, submodular functions, etc., and it is able to express established examples of greedy-solvable optimization problems that they cannot. The linear algebraic approach...
متن کاملCHARACTERIZATION OF L-FUZZIFYING MATROIDS BY L-FUZZIFYING CLOSURE OPERATORS
An L-fuzzifying matroid is a pair (E, I), where I is a map from2E to L satisfying three axioms. In this paper, the notion of closure operatorsin matroid theory is generalized to an L-fuzzy setting and called L-fuzzifyingclosure operators. It is proved that there exists a one-to-one correspondencebetween L-fuzzifying matroids and their L-fuzzifying closure operators.
متن کاملCATEGORICAL RELATIONS AMONG MATROIDS, FUZZY MATROIDS AND FUZZIFYING MATROIDS
The aim of this paper is to study the categorical relations betweenmatroids, Goetschel-Voxman’s fuzzy matroids and Shi’s fuzzifying matroids.It is shown that the category of fuzzifying matroids is isomorphic to that ofclosed fuzzy matroids and the latter is concretely coreflective in the categoryof fuzzy matroids. The category of matroids can be embedded in that offuzzifying matroids as a simul...
متن کاملStructural properties of fuzzy graphs
Matroids are important combinatorial structures and connect close-lywith graphs. Matroids and graphs were all generalized to fuzzysetting respectively. This paper tries to study connections betweenfuzzy matroids and fuzzy graphs. For a given fuzzy graph, we firstinduce a sequence of matroids from a sequence of crisp graph, i.e.,cuts of the fuzzy graph. A fuzzy matroid, named graph fuzzy matro...
متن کاملBASES AND CIRCUITS OF FUZZIFYING MATROIDS
In this paper, as an application of fuzzy matroids, the fuzzifying greedy algorithm is proposed and an achievableexample is given. Basis axioms and circuit axioms of fuzzifying matroids, which are the semantic extension for thebasis axioms and circuit axioms of crisp matroids respectively, are presented. It is proved that a fuzzifying matroidis equivalent to a mapping which satisfies the basis ...
متن کامل